//	ID : pallab81
// 	PROG : 147
// 	LANG : C++
// 	2011-07-21-21.07.49 Thursday
//
// 	"I have not failed, I have just found 10000 ways that won't work.
//


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>

using namespace std;

#define fo(i,ed) for(int i = 0 ; i < ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )

const int inf = 400*100;
float m;
Int ways[ inf+100 ];
const int c[11]= {10000,5000,2000,1000,500,200,100,50,20,10,5};

inline void proc() {
    SET(ways,0);
    int i,j;
    ways[0]=1LL;
    for(i=0; i<11; ++i) {
        for(j=1; j<inf; ++j) {
            if( j>= c[i] ) {
                ways[j]+= ways[j-c[i]];
            }
        }
    }

}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","rt",stdin);
#endif
    proc();
    while( scanf("%f",&m)==1 ) {
        if( m == (float)0.00 ) {
            break;
        }
        int _m = (int)(m*100. +0.5) ;
        printf("%6.2f%17lld\n",m,ways[_m]);
    }


    return 0;
}


